Adaptive directional local search strategy for hybrid evolutionary multiobjective optimization
نویسندگان
چکیده
A novel adaptive local search method is developed for hybrid evolutionary multiobjective algorithms (EMOA) to improve convergence to the Pareto front in multiobjective optimization. The concepts of local and global effectiveness of a local search operator are suggested for dynamic adjustment of adaptation parameters. Local effectiveness is measured by quantitative comparison of improvements in convergence made by local and genetic operators based on a composite objective. Global effectiveness is determined by the ratio of number of local search solutions to genetic search solutions in the nondominated solution set. To be consistent with the adaptation strategy, a new directional local search operator, eLS (efficient Local Search), minimizing the composite objective function is designed. The search direction is determined using a centroid solution of existing neighbor solutions without making explicit calculations of gradient information. The search distance of eLS decreases adaptively as the optimization process converges. Performances of hybrid methods NSGAII+eLS are compared with the baseline NSGA-II and NSGA-II+HCS1 for multiobjective test problems, such as ZDT and DTLZ functions. The neighborhood radius and local search probability are selected as adaptation parameters. Results show that the present adaptive local search strategy can provide significant convergence enhancement from the baseline EMOA by dynamic adjustment of adaptation parameters monitoring the properties of multiobjective problems on the fly.
منابع مشابه
A novel adaptive hybrid crossover operator for multiobjective evolutionary algorithm
In this paper, a novel recombination operator, called adaptive hybrid crossover operator (AHX), is designed for tackling continuous multiobjective optimization problems (MOPs), which works effectively to enhance the search capability of multiobjective evolutionary algorithms (MOEAs). Different from the existing hybrid operators that are commonly operated on chromosome level, the proposed operat...
متن کاملA New Hybrid Evolutionary Multiobjective Algorithm Guided by Descent Directions
Hybridization of local search based algorithms with evolutionary algorithms is still an under-explored research area in multiobjective optimization. In this paper, we propose a new multiobjective algorithm based on a local search method. The main idea is to generate new non-dominated solutions by adding a linear combination of descent directions of the objective functions to a parent solution ....
متن کاملM-PAES: A Memetic Algorithm for Multiobjective Optimization
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, c...
متن کاملGeneralized Multiobjective Evolutionary Algorithm Guided by Descent Directions
This paper proposes a generalized descent directions-guided multiobjective algorithm (DDMOA2). DDMOA2 uses the scalarizing fitness assignment in its parent and environmental selection procedures. The population consists of leader and non-leader individuals. Each individual in the population is represented by a tuple containing its genotype as well as the set of strategy parameters. The main nov...
متن کاملCombining Global and Local Search of Non- Dominated Solutions in Inverse Electromag- Netism
A hybrid local-global and deterministic-evolutionary strategy is proposed for the reduction of objective function calls when Pareto Optimal front approximation is considered in multiobjective optimization problems arising from electromagnetic shape design. Both analytical and real-life test cases are discussed stressing the key-point of switching criteria.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Soft Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 2014